d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
نویسنده
چکیده
This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the reachability problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The experimental results provide promising evidence for the possible successful application of this technique.
منابع مشابه
Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the computational problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamp...
متن کاملVeriication of Linear Hybrid Action Systems
Action Systems is a predicate transformer based formalism for the devel opment of reactive and distributed systems by re nement Lately Action Systems was extended with a di erential action that models continuous be haviour Such action systems capture hybrid systems where a discrete con troller interacts with some continuously evolving environment Recently we investigated a class of Action Syste...
متن کاملNumerical Simulation guided Lazy Abstraction Refinement for Nonlinear Hybrid Automata
This draft suggests a new counterexample guided abstraction refinement (CEGAR) framework that uses the combination of numerical simulation for nonlinear differential equations with linear programming for linear hybrid automata (LHA) to perform reachability analysis on nonlinear hybrid automata. A notion of ǫ− structural robustness is also introduced which allows the algorithm to validate counte...
متن کاملA New Class of Decidable Hybrid Systems
One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete...
متن کاملReachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
This paper introduces iterative relaxation abstraction (IRA), a new method for reachability analysis of LHA that aims to improve scalability by combining the capabilities of current tools for analysis of low-dimensional LHA with the power of linear programming (LP) for large numbers of constraints and variables. IRA is inspired by the success of counterexample guided abstraction refinement (CEG...
متن کامل